//#include <iostream>
//#include <iomanip>
//#include <cstdlib>
//#include <ctime>
//#include "HashTable.h"
//
//using namespace std;
//
//void initZobrist()
//{
//     for(int i=0;i<32;i++)
//     { 
//         for(int j=0;j<32;j++)
//         {
//             srand((unsigned int)time(NULL));
//             Zobrist[i][j]= rand();
//         }
//     }
//}



/*
Table::Table()
{
   Size = 0;
   initZobrist();
}

Table::~Table()
{
   Size = 0; //notice i didn't go through and free up the memory, you could do this with TableDelete in a while loop if you wish
}

void Table::AddToTable(HashNode item)
{

}

void Table::TableDelete(int searchKey)
{

}

int Table::GetIndex(int searchKey)
{
    //hash formula
} 
*/
